Multiple Ant Colony System for Substructure Discovery
نویسندگان
چکیده
A system based on the adaptation of the search principle used in ant colony optimization (ACO) for multiobjective graph-based data mining (GBDM) is introduced in this paper. Our multiobjective ACO algorithm is designed to retrieve the best substructures in a graph database by jointly considering two criteria, support and complexity. The experimental comparison performed with a classical GBDM method shows the good performance of the new proposal on three datasets.
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملComparison of Ant Colony, Elite Ant system and Maximum – Minimum Ant system Algorithms for Optimizing Coefficients of Sediment Rating Curve (Case Study: Sistan River)
By far, different models for determining the relationship between the flow rate and amount of precipitation have been developed. many models are based on regression models with limited assumptions. one of the most common methods for estimating sediment of rivers is sediment rating curve. for better estimation of the amount of sediment based of sediment curve rating equation, it is possible t...
متن کاملA hybridization of evolutionary fuzzy systems and ant Colony optimization for intrusion detection
A hybrid approach for intrusion detection in computer networks is presented in this paper. The proposed approach combines an evolutionary-based fuzzy system with an Ant Colony Optimization procedure to generate high-quality fuzzy-classification rules. We applied our hybrid learning approach to network security and validated it using the DARPA KDD-Cup99 benchmark data set. The results indicate t...
متن کاملMultiple Ant Colony Optimizations for Stereo Matching
The stereo matching problem, which obtains the correspondence between left and right images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task, which is an NP-hard problem in nature. Two characteristics are often utilized to enhance the performance of stereo matching, i.e. concurrent optimization of several scanlines and correlations a...
متن کاملDistributed ACS Algorithm for Resource Discovery in Grid Seyed Mehdi Fattahi1, Nasrolla moghadam Charkari2 1,2Computer Enginee
Grid is an environment that allows sharing of resources that are managed by diverse, independent administrative organizations that are geographically distributed. The main objective of grid is to enable users to solve problems using the available geographically distributed resources. To fully utilize these resources, effective discovery techniques are necessities. Grid resource discovery refers...
متن کامل